The total coloring of a multigraph with maximal degree 4
نویسندگان
چکیده
منابع مشابه
Strategies for Multigraph Edge Coloring
n mathematical graph theory, coloring problems are ubiquitous. Dating back to the famous four-color map problem, both the theory and applications associated with graph coloring have a rich history. A standard problem in graph theory is to color a graph’s vertices with the fewest number of colors such that no two adjacent vertices have the same color. This article examines a complementary proble...
متن کاملTotal-Coloring of Plane Graphs with Maximum Degree Nine
The central problem of the total-colorings is the total-coloring conjecture, which asserts that every graph of maximum degree ∆ admits a (∆+2)-total-coloring. Similar to edge-colorings—with Vizing’s edge-coloring conjecture—this bound can be decreased by 1 for plane graphs of higher maximum degree. More precisely, it is known that if ∆ ≥ 10, then every plane graph of maximum degree ∆ is (∆ + 1)...
متن کاملThe total chromatic number of any multigraph with maximum degree five is at most seven
The result announced in the title is proved. A new proof of the total 6-colorability of any multigraph with maximum degree 4 is also given.
متن کاملSatellite communications and multigraph edge-coloring
An overview of satellite communication scheduling and its relation to edge-coloring of multigraphs is given. Then a theorem about a restricted class of multigraphs is proved to obtain conditions for scheduling in a satellite communications network of practical interest Some limitations of the multigraph model are then discussed.
متن کاملOn strong edge-coloring of graphs with maximum degree 4
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a(G). It was conjectured by Alon, Sudakov and Zaks that for any simple and finite graph G, a(G) ≤ ∆+ 2, where ∆ = ∆(G) denotes the maximum degree of G. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1977
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90146-7